List Homomorphism with Accumulation
نویسندگان
چکیده
This paper introduces accumulation into list homomorphisms for systematic development of both efficient and correct parallel programs. New parallelizable recursive pattern called H-homomorphism is given, and transformations from sequential patterns in the H-form and Hform into (H-)homomorphism are shown. We illustrate the power of our formalization by developing a novel and general parallel program for a class of interesting and challenging problems, known as maximum marking problems.
منابع مشابه
Dichotomy for tree-structured trigraph list homomorphism problems
Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to be polynomial time solvable or NP -complete. Thus while digraph list homomorphism problems enjoy dichotomy (each problem is NP -complete or polynomial time solvable), such dichotomy is not necessarily expected for tri...
متن کاملBounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of deciding whether a structure A ∈ C has a homomorphism to a given arbitrary structure B, when each element in A is only allowed a certain subset of elements of B as its image. We prove, under a certain complexity-theore...
متن کاملMmpP: Maximum Marking Problems in Parallel
Maximum marking problems (Mmp for short) are to put a mark on the entries of some given data structure in a way such that a given constraint is satisfied and the sum of the weights associated with marked entries is as large as possible. It was shown that the linear time algorithm can be obtained provided that the characterizing function of the constraint is a finite homomorphism. This paper dem...
متن کاملList Homomorphisms and Circular Arc Graphs
List homomorphisms generalize list colourings in the following way: Given graphs G; H , and lists L(v) V (H); v 2 V (G), a list homomorphism of G to H with respect to the lists L is a mapping f : V (G) ! V (H) such that uv 2 E (G) implies f (u)f(v) 2 E (H), and f (v) 2 L(v) for all v 2 V (G). The list homomorphism problem for a xed graph H asks whether or not an input graph G together with list...
متن کاملMinimum Cost and List Homomorphisms to Semicomplete Digraphs
For digraphs D and H, a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). Let H be a fixed directed or undirected graph. The homomorphism problem for H asks whether a directed or undirected graph input digraph D admits a homomorphism to H. The list homomorphism problem for H is a generalization of the homomorphism problem for H, where every vertex x ∈ V (...
متن کامل